搜索资源列表
fenzhixianjie_zuiyouzhuangzai
- 使用分支限界算法解决最优装载问题,是算法分析与设计的经典。-Using the branch and bound algorithm to solve the optimal loading problem is a classic algorithm analysis and design.
0-1bag
- 实现0—1背包问题的分支限界搜索,为控制台应用程序,编译环境为vs2008-0-1 knapsack problem to achieve the branch and bound search for the console application, compile environment for vs2008
sftrie_src
- Shortest Common Superstring Problem by using suffix trie and branch-and-bound. This code is from Shin, YoungJin, Korea
hamilton
- 用分支与界法解决旅行商问题,c++源代码。十分快速。-With the branch and bound algorithm to solve traveling salesman problem, c++ source code. Very fast.
MATLABoptimization
- matlab最优化程序包括 无约束一维极值问题 进退法 黄金分割法 斐波那契法 牛顿法基本牛顿法 全局牛顿法 割线法 抛物线法 三次插值法 可接受搜索法 Goidstein法 Wolfe.Powell法 单纯形搜索法 Powell法 最速下降法 共轭梯度法 牛顿法 修正牛顿法 拟牛顿法 信赖域法 显式最速下降法, Rosen梯度投影法 罚函数法 外点罚函数法 內点罚函数法 混合罚函数法 乘子法 G-N法 修正G-N法 L-M法
bags
- 四种算法(动态规划、回溯法、分支限界法、贪心法)实现0-1背包问题-four algorithms including dynamic planningm,tracing,branch and bound method and greedy to implement 0-1 bag problem.
C
- 利用分支限界算法求解最优装载,实现了最优装载问题的求解-The use of branch and bound algorithm to solve the optimal load to achieve the optimal load for solving the problem
limit
- 用C实现了分支限界算法,读者可以运行该程序理解分支限界算法-Achieved with the C branch and bound algorithm, readers can run the program understand the branch and bound algorithm for
linearandintegercode
- 线性规划问题(单纯形法、完整单纯形法与修正单纯形法)与整数规划问题(割平面法、分支定界法与0-1规划)的matlab源程序-matlab source programs of linear programming including simple method, complete simple method and modified simple method and integer programming including dividing plane method, branch and
minto
- 用带线性松驰的分支定界算法求解混合整数线性规划问题的软件系统源代码-MINTO is a software system that solves mixed-integer linear programs by a branch-and-bound algorithm with linear programming relaxations.
branch_bound
- 改程序为用C语言编写的运筹学分支定界法程序,欢迎大家下载纠错!-branch and bound
jingdiansuanfa
- 经典算法+分支限界法+分治法+动态规划+贪心算法+回溯法-Classical branch and bound algorithm+ France+ divide and conquer dynamic programming+++ backtracking greedy algorithm
BestFirstSearch_HeapAlgo
- 1. 此程式執行將從路徑讀取一個文字檔 ( 路徑:C:INPUT.TXT ) 2. 執行結束會產生一個排序後的文字檔 ( 路徑:C:OUTPUT.TXT ) 3. 給定的初始盤面一定有解 本程式採用的演算法策略為Best-first search with branch-and-bound algorithm 1. 使用Max heap 實作Priority queue 2. 使用bound function 估計目前盤面走至答案最少需要幾步 第一部分 所謂 h
1234
- 2010最新的用分枝界限法解决最大多样性问题的SCI论文。-This article begins with a review of previously proposed integer formulations for the maximum diversity problem (MDP). This problem consists of selecting a subset of elements from a larger set in such a way that the
AlgorithmCode
- C++版本的各类算法源代码,包括动态规划法、分治法、贪心法、回溯法、分支限界法、概率算法-C++ source code version of the various algorithms, including dynamic programming, divide and conquer, greedy method, backtracking, branch and bound method, probability algorithm
TravellingSalesman
- TSP Problem In Java .. it is not a complete code but it will give you a picture for that
a
- 货郎担问题:求解货郎担问题的分枝限界算法-Traveling Salesman Problem: Solving the branch and bound algorithm for Traveling Salesman Problem
MCMProjects
- 我备战2010数学建模美赛所精心准备的算法资料,一共13个算法。应该说是目前比较全的算法集了。每个算法由一个VC6例子实现,来解决一个问题。其中一些是自己编写,其它的也是由网上找到后经过修改编译通过的。比赛结果还不错,一个M,现在把资料共享出来,希望对大家有所帮助,算法主要有模拟退火,遗传算法,蒙特卡罗算法,蚁群算法,粒子群算法,元胞自动机,Dijkstra,最小生成树算法,二分图最大匹配算法,最大流算法,动态规划算法,分支定界法,排队论算法,决策论算法等,我写了个说明文件,列的挺详细的-I a
traveller
- 本程序是算法设计的经典问题,采用分支限界发解决旅行商问题-This program is a classic algorithm design problem, using branch and bound fat Traveling Salesman Problem
download
- 分支界限算法 ,用队列解决最优装载问题,跟背包算法有同样的功能-Branch and bound algorithm, the optimal loading queue to resolve the problem, with the same functionality Knapsack Algorithm